A Scalable Peer-to-Peer Lookup Model

نویسندگان

  • Haitao Chen
  • Chuanfu Xu
  • Zunguo Huang
  • Huaping Hu
  • Zhenghu Gong
چکیده

One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms , this paper presents a hierarchical and manageable resource locating model (HMRLM)which can provide P2P networks with scalability and manageability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. We propose a new scalable Peer-to-Peer overlay network, GFS-Btree, which is resembling a Btree network. By adding additional linkages to Btree, GFS-Btree can relieve the congestion at the root and the other branch nodes. The events of a node joining and leaving th...

متن کامل

Fast Scalable Peer-to-Peer Lookup Services for Multi-Hop Wireless Networks

Title of dissertation: Fast Scalable Peer-to-Peer Lookup Services for Multi-Hop Wireless Networks Min-Ho Shin Doctor of Philosophy, 2007 Dissertation directed by: Professor William A. Arbaugh Department of Computer Science Distribution Date (version) : Jan. 15, 2008 Recent years have seen growing popularity of multi-hop wireless networks such as wireless mesh networks and sensor networks. Such ...

متن کامل

Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems

This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a wide range of peer-to-peer applications like global data storage, glo...

متن کامل

Scalable State Replication with Weak Consistency

Initial work on peer-to-peer systems has focused on finding information in large-scale decentralized systems. More recently, the focus has shifted to sharing information in such contexts. Meeting this goal in environments in which many data replicas change their state frequently is very challenging. The objectives of the work described in this paper is twofold: designing mechanisms that allow i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003